Algorithms & Complexity
Algorithms are fundamental objects of study in computer science. They are not only the basic building blocks of the computational world around us, but algorithmic processes are ubiquitous in nature too. In this fast-paced world we are not only satisfied with solving a task, but we would like to solve them as fast as possible. The related area of Computational Complexity theory focuses on this issue of computational efficiency. That is, it aims to quantify the amount of computational resources required to solve a given task.
The primary research focus of the Algorithms and Complexity group at CSTAR is on the mathematical foundations of computation. These include algorithms, combinatorics, computational complexity, coding theory and their myriad connections to mathematics.
Members
Faculty